Total colorings of some classes of four regular circulant graphs
نویسندگان
چکیده
The total chromatic number, χ″(G) is the minimum number of colors which need to be assigned obtain a coloring graph G. Total Coloring Conjecture (TCC) made independently by Behzad and Vizing that for any graph, χ″(G)≤Δ(G)+2, where Δ(G) represents maximum degree In this paper we obtained some classes four regular circulant graphs.
منابع مشابه
on the symmetries of some classes of recursive circulant graphs
a recursive-circulant $g(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$g(n; d)$ is vertex-transitive, and has some strong hamiltonianproperties. $g(n; d)$ has a recursive structure when $n = cd^m$,$1 leq c < d $ [10]. in this paper, we will find the automorphismgroup of some classes of recursive-circulant graphs. in particular, wewill find that the autom...
متن کاملEdge Coloring by Total Labelings of 4-regular Circulant Graphs
Edge-coloring total k-labeling of a connected graph G is an assignment f of non negative integers to the vertices and edges of G such that two adjacent edges e = uv and e = uv of G have different weights. The weight of an edge uv is defined by: w(e = uv) = f(u) + f(v) + f(e). In this paper, we study the chromatic number of the edge coloring by total labeling of 4-regular circulant graphs Cn(1, k).
متن کاملIrregular colorings of regular graphs
An irregular coloring of a graph is a proper vertex coloring that distinguishes vertices in the graph either by their own colors or by the colors of their neighbors. In algebraic graph theory, graphs with a certain amount of symmetry can sometimes be specified in terms of a group and a smaller graph called a voltage graph. In [3], Radcliffe and Zhang found a bound for the irregular chromatic nu...
متن کاملSome Results on List Total Colorings of Planar Graphs
Let G be a planar graph with maximum degree Δ. In this paper, it is proved that if Δ ≥ 9, then G is total-(Δ+2)-choosable. Some results on list total coloring of G without cycles of specific lengths are given.
متن کاملTotal Colorings Of Degenerate Graphs
A total coloring of a graph G is a coloring of all elements of G, i.e. vertices and edges, such that no two adjacent or incident elements receive the same color. A graph G is sdegenerate for a positive integer s if G can be reduced to a trivial graph by successive removal of vertices with degree ≤ s. We prove that an s-degenerate graph G has a total coloring with ∆+1 colors if the maximum degre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2022
ISSN: ['2543-3474', '0972-8600']
DOI: https://doi.org/10.1080/09728600.2022.2088316